<b>Prospecting molecular markers to distinguish <i>Cichla kelberi</i>, <i>C. monoculus</i> and <i>C. piquiti
نویسندگان
چکیده
منابع مشابه
(IC)LM-FUZZY TOPOLOGICAL SPACES
The aim of the present paper is to define and study (IC)$LM$-fuzzytopological spaces, a generalization of (weakly) induced $LM$-fuzzytopological spaces. We discuss the basic properties of(IC)$LM$-fuzzy topological spaces, and introduce the notions ofinterior (IC)-fication and exterior (IC)-fication of $LM$-fuzzytopologies and prove that {bf ICLM-FTop} (the category of(IC)$LM$-fuzzy topological ...
متن کاملIC-Colorings and IC-Indices of graphs
Given a coloring f : V (G) → IN of graph G and any subgraph H ⊂ G we define fs(H) = ∑ v∈V (H) f(v). In particular, we denote fs(G) by S(f). The coloring f is called an ICcoloring if for any integer k ∈ [1, S(f)] there is a connected subgraph H ⊂ G such that fs(H) = k. Also, we define the IC-index of G to be M(G) = max{ S(f) : f is an IC-coloring of G }. In this paper we examine some well-known ...
متن کاملComparing a Linguist ic and a Stochast ic Tagger
Concerning different approaches to automatic PoS tagging: EngCG-2, a constraintbased morphological tagger, is compared in a double-blind test with a state-of-the-art statistical tagger on a common disambiguation task using a common tag set. The experiments show that for the same amount of remaining ambiguity, the error rate of the statistical tagger is one order of magnitude greater than that o...
متن کاملIc Esi
This paper describes the meta-level control system of a program (Dominic) for parametric design of mechanical components by iterative redesign. We view parametric design as search, and thus Dominic is a hill climbing algorithm. However, from experience with Dominic we concluded that modeling engineering design as hill climbing has several limitations. Therefore, a need for meta-level control kn...
متن کاملIc Censors
We introduce an adaptive search technique that speeds up state space search by learning heuristic censors while searching. The censors speed up search by pruning away moTe and more of the space until a solution is found in the pruned space. Censors are learned by explaining dead ends and other search failures. To learn quickly, the technique over-generalizes by assuming that certain constraints...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Scientiarum. Biological Sciences
سال: 2015
ISSN: 1807-863X,1679-9283
DOI: 10.4025/actascibiolsci.v37i4.25985